A comparison of interpolation grids over the triangle or the tetrahedron
نویسنده
چکیده
A simple strategy for constructing a sequence of increasingly refined interpolation grids over the triangle or the tetrahedron is discussed with the goal of achieving uniform convergence and ensuring high interpolation accuracy. The interpolation nodes are generated based on a one-dimensional master grid comprised of the zeros of the Lobatto, Legendre, Chebyshev, and second-kind Chebyshev polynomials. Numerical computations show that the Lebesgue constant and interpolation accuracy of some proposed grids compare favorably with those of alternative grids constructed by optimization, including the Fekete set. While some sets are clearly preferable to others, no single set can claim uniformly better convergence properties as the number of nodes is raised.
منابع مشابه
A Lobatto interpolation grid in the tetrahedron
A sequence of increasingly refined interpolation grids inside the tetrahedron is proposed with the goal of achieving uniform convergence and ensuring high interpolation accuracy. The number of interpolation nodes, N , corresponds to the number of terms in the complete mth-order polynomial expansion with respect to the three tetrahedral barycentric coordinates. The proposed grid is constructed b...
متن کاملComparison of Stiffness and Failure Behavior of the Laminated Grid and Orthogrid Plates
The present paper investigates the advantages of a new class of composite grid structures over conventional grids. Thus far, a known grid structure such as orthogrid or isogrid has been used as an orthotropic layer with at most in-plane anisotropy. The present laminated grid is composed of various numbers of thin composite grid layers. The stiffness of the structure can be adjusted by choosing ...
متن کاملHIERARCHICAL COMPUTATION OF HERMITE SPHERICAL INTERPOLANT
In this paper, we propose to extend the hierarchical bivariateHermite Interpolant to the spherical case. Let $T$ be an arbitraryspherical triangle of the unit sphere $S$ and let $u$ be a functiondefined over the triangle $T$. For $kin mathbb{N}$, we consider aHermite spherical Interpolant problem $H_k$ defined by some datascheme $mathcal{D}_k(u)$ and which admits a unique solution $p_k$in the ...
متن کاملParticle tracing in curvilinear grids
Computational fluid dynamics simulations result in large multivariate data sets with information such as pressure, temperature and velocity available at grid points for a sequence of steps. Velocity data is typically visualized by displaying a particle animation or streamlines. We present an efficient method for calculating particle paths based on velocity data from curvilinear grids. In order ...
متن کاملThe Tits alternative for generalised tetrahedron groups
A generalised tetrahedron group is the colimit of a triangle of groups whose vertex groups are generalised triangle groups and whose edge groups are finite cyclic. We prove an improved Spelling Theorem for generalised triangle groups which enables us to compute the precise Gersten-Stallings angles of this triangle of groups, and hence obtain a classification of generalised tetrahedron groups ac...
متن کامل